IN THIS PAPER, WE FIRST GIVE A FORMAL DESCRIPTION FOR Cellular LEARNING Automata THEN STUDY ITS CONVERGENCE BEHAVIOR. IT IS SHOWN THAT FOR PERMUTABLE RULES, THE Cellular LEARNING Automata CONVERGE TO A STABLE AND COMPATIBLE CONFIGURATION. THE NUMERICAL RESULTS ALSO CONFIRM OUR THEORETICAL INVESTIGATIONS.